Open Problem—Weakly Interacting Particle Systems on Dense Random Graphs
نویسندگان
چکیده
منابع مشابه
From Interacting Particle Systems to Random Matrices
In this contribution we consider stochastic growth models in the Kardar-Parisi-Zhang universality class in 1+1 dimension. We discuss the large time distribution and processes and their dependence on the class on initial condition. This means that the scaling exponents do not uniquely determine the large time surface statistics, but one has to further divide into subclasses. Some of the fluctuat...
متن کاملMultiple Random Walks and Interacting Particle Systems
We study properties of multiple random walks on a graph under variousassumptions of interaction between the particles.To give precise results, we make our analysis for random regular graphs.The cover time of a random walk on a random r-regular graph was studiedin [6], where it was shown with high probability (whp), that for r ≥ 3 thecover time is asymptotic to θrn lnn, where...
متن کاملConsensus of Interacting Particle Systems on Erdös-Rényi Graphs
Interacting Particle Systems—exemplified by the voter model, iterative majority, and iterative k−majority processes—have found use in many disciplines including distributed systems, statistical physics, social networks, and Markov chain theory. In these processes, nodes update their “opinion” according to the frequency of opinions amongst their neighbors. We propose a family of models parameter...
متن کاملRandom Matrix Theory , Interacting Particle Systems and Integrable Systems Percy
The proposal sought a five-year renewal of NSF funding to support the Institute’s fundamental mission to advance scientific research and collaboration among mathematicians hosted through MSRI’s programs and workshops. The proposal made a strong case for a substantial increase in funding over the level of the past ten years of the NSF Core Grant. It was written by the Directorate in consultation...
متن کاملInteracting Particle Systems
3 4 CONTENTS Preface Interacting particle systems, in the sense we will be using the word in these lecture notes, are countable systems of locally interacting Markov processes. Each interacting particle system is define on a lattice: a countable set with (usually) some concept of distance defined on it; the canonical choice is the d-dimensional integer lattice Z d. On each point in this lattice...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Systems
سال: 2019
ISSN: 1946-5238,1946-5238
DOI: 10.1287/stsy.2019.0049